An Optimal Parallel Algorithm for Preemptive Job Scheduling that Minimizes Maximum Lateness
نویسنده
چکیده
In this paper we present the Preemptive Minimize Maximum Lateness algorithm, an optimal parallel algorithm that schedules jobs for execution on a single processor machine with preemption. Each job is described by a release time, a deadline and a processing time. A job is considered late if it does not complete by its deadline and its lateness is defined as the difference between its completion time and deadline. Using the CREW PRAM model, our algorithm schedules n jobs for execution and minimizes the maximum lateness of the jobs. Our algorithm runs in O(logn) time and uses O(n) processors, which is the first optimal processor-time product algorithm for this problem. The technique we use can be applied to other job scheduling problems, improving their results. We give faster parallel algorithms for three additional scheduling problems. t This research was partially supported by the Office of Naval Research on contract N 00014-86-K-0689. An Optimal Parallel Algorithm for Preemptive Job Scheduling that Minimizes Maximum Lateness
منابع مشابه
Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness
We develop an O (q2n + nlogn) algorithm to obtain a preemptive schedule that minimizes maximum lateness when n jobs with given due dates and memory requirements are to be scheduled on m processors (n ≥ m) of given memory sizes. q is the number of distinct due dates. The value of the minimum maximum lateness can itself be found in O(qn + nlogn) time.
متن کاملScheduling with alternatives: a link between process planning and scheduling
The objective of this research is to develop and evaluate eective, computationally ecient procedures for scheduling jobs in a large-scale manufacturing system involving, for example, over 1000 jobs and over 100 machines. The main performance measure is maximum lateness; and a useful lower bound on maximum lateness is derived from a relaxed scheduling problem in which preemption of jobs is bas...
متن کاملPreemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates
This paper is concerned with the problem of scheduling preemptive tasks subject to precedence constraints in order to minimize the maximum lateness and the makespan. The number of available parallel processors is allowed to vary in time. It is shown that when an Earliest Due Date rst algorithm provides an optimal nonpreemptive schedule for unit-execution-time (UET) tasks, then the preemptive pr...
متن کاملScheduling on uniform parallel machines to minimize maximum lateness
We consider the uniform parallel machine scheduling problem with the objective of minimizing maximum lateness. We show that an extension of the EDD rule to a uniform parallel machine setting yields a maximum lateness value which does not exceed the optimal value by more than pmax, where pmax is the maximum job processing time. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملA New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کامل